Information storing by biomagnetites

Storing information with extractors

We deal with the problem of storing a set of K elements that are taken from a large universe of size N , such that membership in the set can be determined with high probability by looking at just one bit of the representation. Buhrman et al. show an explicit construction with about K2 logN storing bits. We show an explicit construction with about K1+o(1) storing bits, that gets closer to the op...

One method of storing information

Formulate the problem as follows. Split a file into n pieces so that it can be restored without any m parts (1<=m<=n). Such problems are called problems secret sharing. There exists a set of methods for solving such problems, but they all require a fairly large number of calculations applied to the problem posed above. The proposed method does not require calculations, and requires only the ope...

Method for Storing and Retrieving Sequential Information

STORING A SPARSE TABLE bY

The problem of storing and searching large sparse tables arises in compiling and in other areas of computer science. The standard technique for storing such tables is hashing, but hashing has poor worst-case performance. We consider good worst-case methods for storing a table of n entries, each an integer between 0 and N-l . For dynamic tables, in which look-ups and table additions are intermix...

Storing and Querying XML Documents Without Using Schema Information

As the popularity of eXtensible Markup Language (XML) continues to increase at an astonishing pace, data management systems for storing and querying large repositories of XML data are urgently needed. In this paper, we investigate using a Relational Database Management System (RDBMS) for storing and querying XML data. We present a mapping scheme, called PAID, for mapping XML documents to relati...